High performance computing approach for DNA motif discovery
نویسندگان
چکیده
منابع مشابه
Performance evaluation of DNA Motif discovery programs
Methods for the identification of transcription factor binding sites have proved to be useful for deciphering genetic regulatory networks. The strengths and weaknesses for a number of available web tools are not fully understood. Here, we designed a comprehensive set of performance measures and benchmarked sequence-based motif discovery tools using large scale datasets (derived from Escherichia...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملA Combinatorial Approach for Motif Discovery in Unaligned DNA Sequences
Motif (conserved pattern) modelling and finding in unaligned DNA sequences is a fundamental problem in computational biology with important applications in understanding gene regulation. Biological approaches for this problem are tedious and time-consuming. Large amounts of genome sequence data and gene expression micro-array data let us solve this problem computationally. Most computer science...
متن کاملAutomated DNA Motif Discovery
Ensembl’s human non-coding and protein coding genes are used to automatically find DNA pattern motifs. The Backus-Naur form (BNF) grammar for regular expressions is used by genetic programming to ensure the generated strings are legal. The evolved motif suggests the presence of Thymine followed by one or more Adenines etc. early in transcripts indicate a non-protein coding gene.
متن کاملdevelopment of an efficient hybrid method for motif discovery in dna sequences
this work presents a hybrid method for motif discovery in dna sequences. the proposed method called spso-lk, borrows the concept of chebyshev polynomials and uses the stochastic local search to improve the performance of the basic pso algorithm as a motif finder. the chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CSI Transactions on ICT
سال: 2019
ISSN: 2277-9078,2277-9086
DOI: 10.1007/s40012-019-00235-w